Extending ACOR to Solve Multi-Objective Problems
نویسندگان
چکیده
Ant Colony Optimization (ACO) was first proposed to solve the Traveling Salesman Problem, and later applied to solve more problems of a combinatorial nature. Some research based on ACO to tackle continuous problems has been published, but this has not followed the original ACO metaheuristic exactly. Recently, ACOR has been proposed to solve continuous function optimization problems. We have taken this work and extended it to solve multi-objective optimization problems. After an analysis of the results obtained, including comparisons with two other well-known methods, we conclude that ACOR is a promising new technique for solving multi-objective problems.
منابع مشابه
Expanding ACOR to solve multi-objective problems
Recently ACO R has been proposed to solve continuous function optimization problems. We have taken this work and expanded it to solve multi-objective optimization problems. After a brief analysis of the results obtained and have compared them with other two well-know methods, we state that solutions from ACO R are promising.
متن کاملConstrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...
متن کاملPSO for multi-objective problems: Criteria for leader selection and uniformity distribution
This paper proposes a method to solve multi-objective problems using improved Particle Swarm Optimization. We propose leader particles which guide other particles inside the problem domain. Two techniques are suggested for selection and deletion of such particles to improve the optimal solutions. The first one is based on the mean of the m optimal particles and the second one is based on appoin...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کامل